Uniform star-factors of graphs with girth three
نویسندگان
چکیده
A star-factor of a graph G is a spanning subgraph of G such that each component of which is a star. Recently, Hartnell and Rall studied a family U of graphs satisfying the property that every star-factor of a member graph has the same number of edges. They determined the family U when the girth is at least five. In this paper, we investigate the family of graphs with girth three and determine all members of this family.
منابع مشابه
J ul 2 00 7 Uniformly Weighted Star - Factors of Graphs ∗
A star-factor of a graph G is a spanning subgraph of G such that each component of which is a star. An edge-weighting of G is a function w : E(G) −→ N, where N is the set of positive integers. Let Ω be the family of all graphs G such that every star-factor of G has the same weights under a fixed edge-weighting w. In this paper, we present a simple structural characterization of the graphs in Ω ...
متن کاملUniformly Weighted Star-Factors of Graphs
A star-factor of a graph G is a spanning subgraph of G such that each component is a star. An edge-weighting of G is a function w : E(G) −→ N, where N is the set of positive integers. Let Ω be the family of all graphs G such that every star-factor of G has the same weight under some fixed edge-weighting w. The open problem of characterizing the class Ω, posed by Hartnell and Rall, is motivated ...
متن کاملAcircuitic directed star arboricity of planar graphs with large girth
A directed star forest is a forest all of whose components are stars with arcs emanating from the center to the leaves. The acircuitic directed star arboricity of an oriented graph G is the minimum number of edge-disjoint directed star forests whose union covers all edges of G and such that the union of two such forests is acircuitic. We show that graphs with maximum average degree less than 7 ...
متن کاملStar Coloring High Girth Planar Graphs
A star coloring of a graph is a proper coloring such that no path on four vertices is 2-colored. We prove that every planar graph with girth at least 9 can be star colored using 5 colors, and that every planar graph with girth at least 14 can be star colored using 4 colors; the figure 4 is best possible. We give an example of a girth 7 planar graph that requires 5 colors to star color.
متن کاملOn star and caterpillar arboricity
We give new bounds on the star arboricity and the caterpillar arboricity of planar graphs with given girth. One of them answers an open problem of Gyárfás and West: there exist planar graphs with track number 4. We also provide new NP-complete problems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Australasian J. Combinatorics
دوره 39 شماره
صفحات -
تاریخ انتشار 2007